Identities in Finitely Generated Semigroups of Polynomial Growth

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finitely generated groups with polynomial index growth

We prove that a finitely generated soluble residually finite group has polynomial index growth if and only if it is a minimax group. We also show that if a finitely generated group with PIG is residually finite-soluble then it is a linear group. These results apply in particular to boundedly generated groups; they imply that every infinite BG residually finite group has an infinite linear quoti...

متن کامل

Weak Identities in Finitely Generated Groups

In this article we introduce the notion of weak identities in a group and study their properties. We show that weak identities have some similar properties to ordinary ones. We use this notion to prove that any finitely generated solvable discriminating group is abelian, which answers a question raised in [3].

متن کامل

Finitely Generated Weakly Reductive Commutative Semigroups∗

We give characterizations of the property of being weakly reductive for finitely generated commutative semigroups. As a consequence of these characterizations we obtain an algorithm for determining from a presentation of a finitely generated commutative semigroup whether it is weakly reductive. Furthermore, we present some connections between cancellative finitely generated commutative semigrou...

متن کامل

Finitary Power Semigroups of Infinite Groups Are Not Finitely Generated

For a semigroup S the finitary power semigroup of S, denoted Pf (S), consists of all finite subsets of S under the usual multiplication. The main result of this paper asserts that Pf (G) is not finitely generated for any infinite group G.

متن کامل

A Note on Finitely Generated Semigroups of Regular Languages∗

Let E = {E1, . . . , Ek} be a set of regular languages over a finite alphabet Σ. Consider morphism φ : ∆ → (S, ·) where ∆ is the semigroup over a finite set ∆ and (S, ·) = 〈E〉 is the finitely generated semigroup with E as the set of generators and language concatenation as a product. We prove that the membership problem of the semigroup S, the set [u] = {v ∈ ∆ | φ(v) = φ(u)}, is a regular langu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1993

ISSN: 0021-8693

DOI: 10.1006/jabr.1993.1004